Local Bigraphs and Confluence : Two Conjectures : ( Extended

نویسنده

  • Robin Milner
چکیده

The notion of confluence is studied on the context of bigraphs. Confluence will be important in modelling real-world systems, both natural (as in biology) and artificial (as in pervasive computing). The paper uses bigraphs in which names have multiple locality; this enables a formulation of the lambda calculus with explicit substitutions. The paper reports work in progress, seeking conditions on a bigraphical reactive system that are sufficient to ensure confluence; the conditions must deal with the way that bigraphical redexes can be intricately intertwined. The conditions should also be satisfied by the lambda calculus. After discussion of these issues, two conjectures are put forward.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Explorer Local Bigraphs and Confluence : Two Conjectures : ( Extended

The notion of confluence is studied on the context of bigraphs. Confluence will be important in modelling real-world systems, both natural (as in biology) and artificial (as in pervasive computing). The paper uses bigraphs in which names have multiple locality; this enables a formulation of the lambda calculus with explicit substitutions. The paper reports work in progress, seeking conditions o...

متن کامل

Axiomatizing Binding Bigraphs

We axiomatize the congruence relation for binding bigraphs and prove that the generated theory is complete. In doing so, we define a normal form for binding bigraphs, and prove that it is unique up to certain isomorphisms. Our work builds on Milner’s axioms for pure bigraphs. We have extended the set of axioms with five new axioms concerned with binding, and we have altered some of Milner’s axi...

متن کامل

Five Basic Concepts of Axiomatic Rewriting Theory

In this invited talk, I will review five basic concepts of Axiomatic Rewriting Theory, an axiomatic and diagrammatic theory of rewriting started 25 years ago in a LICS paper with Georges Gonthier and Jean-Jacques Lévy, and developed along the subsequent years into a full-fledged 2-dimensional theory of causality and residuation in rewriting. I will give a contemporary view on the theory, inform...

متن کامل

Riemann Fever

The confluence of computer science and quantum mechanics has inspired a proof of the Riemann Hypothesis for the discrete geometric (Clifford) algebras Cl(n,0) over Z3 = {0,1,−1}, as expected from the Weil Conjectures. The symptoms of Riemann Fever are clearly evident here long periods of apathy punctuated by febrile investigations lasting from minutes to (here, two) weeks, accompanied by altern...

متن کامل

A SAT based algorithm for the matching problem in bigraphs with sharing

Bigraphical reactive systems are a formalism for modelling mobile computation. A bigraph consists of a place graph and a link graph; reaction rules define how place and link graphs evolve. Bigraphs originally supported only tree structures as place graphs, we have extended the formalism to bigraphs with sharing, which allow directed acyclic graphs as place graphs. A major challenge for bigraph ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017